# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
        def dfs1(sum_now: int, list_now: List[int]):
            nonlocal ans
            if sum_now == target:
                list_now.sort()
                new_list = tuple(list_now)
                if new_list not in ans:
                    ans.add(new_list)
                    return

            if sum_now > target:
                return

            for i in range(0, len(candidates)):
                dfs1(sum_now + candidates[i], list_now + [candidates[i]])

        def dfs2(start_index: int, sum_now: int, list_now: List[int]):
            nonlocal ans
            if sum_now == target:
                new_list = tuple(list_now)
                ans.add(new_list)
                return
            if sum_now > target:
                return

            for i in range(start_index, len(candidates)):
                dfs2(i, sum_now + candidates[i], list_now + [candidates[i]])

        ans = set()
        # dfs1(0, [])
        dfs2(0, 0, [])
        real_ans = []
        for item in ans:
            real_ans.append(list(item))
        return real_ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([2, 3, 5], 8, [[2, 2, 2, 2], [2, 3, 3], [3, 5]]),
        ([2, 3, 6, 7], 7, [[2, 2, 3], [7]]),
        ([2], 1, []),
        ([1], 1, [[1]])
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]

        expect = case_item[len(case_item) - 1]

        exec_result = solution.combinationSum(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

